Simple Algorithm for Sorting the Fibonacci String Rotations
نویسندگان
چکیده
In this paper we focus on the combinatorial properties of the Fibonacci strings rotations. We first present a simple formula that, in constant time, determines the rank of any rotation (of a given Fibonacci string) in the lexicographically-sorted list of all rotations. We then use this information to deduce, also in constant time, the character that is stored at any one location of any given Fibonacci string. Finally, we study the output of the Burrows-Wheeler Transform (BWT) on Fibonacci strings to prove that when BWT is applied to Fibonacci strings it always produces a sequence of ‘b’s followed by a sequence of ‘a’s.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملThe Matrices of Fibonacci Numbers
In a recent paper, Kalman [3] derives many interesting properties of generalized Fibonacci numbers. In this paper, we take a different approach and derive some other interesting properties of matrices of generalized Fibonacci numbers. As an application of such properties, we construct an efficient algorithm for computing matrices of generalized Fibonacci numbers. The topic of generalized Fibona...
متن کاملNotes on Block-Sorting Data Compression
The block-sorting data compression method of Burrows and Wheeler has received considerable attention in anticipation that it may be comparable, or even superior, to the ZivLempel codes. This article discusses its characteristic points from the viewpoint of string algorithms. The block-sorting compression algorithm initially sorts all rotations of an input text lexicographically. This transform...
متن کاملParallel Sorting and Star-P Data Movement and Tree Flattening
This thesis studies three problems in the field of parallel computing. The first result provides a deterministic parallel sorting algorithm that empirically shows an improvement over two sample sort algorithms. When using a comparison sort, this algorithm is 1-optimal in both computation and communication. The second study develops some extensions to the Star-P system [7, 6] that allows it to s...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کامل